Connecting (Anti)Symmetric Trigonometric Transforms to Dual-Root Lattice Fourier–Weyl Transforms
نویسندگان
چکیده
منابع مشابه
Trigonometric Series via Laplace Transforms
Costas J. Efthimiou Department of Physics University of Central Florida Orlando, FL 32816 USA Introduction In another NOTE in this MAGAZINE, the author presented a method [2] that uses the Laplace transform and allows one to find exact values for a large class of convergent series of rational terms. Recently, in this MAGAZINE too, Lesko and Smith [3] revisited the method and demonstrated an ext...
متن کاملDual-Tree Fast Gauss Transforms
Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the ...
متن کاملParallel Architecture for Fast Transforms with Trigonometric Kernel
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perf...
متن کاملMultiplication Symmetric Convolution Property for Discrete Trigonometric Transforms
The symmetric-convolution multiplication (SCM) property of discrete trigonometric transforms (DTTs) based on unitary transform matrices is developed. Then as the reciprocity of this property, the novel multiplication symmetric-convolution (MSC) property of discrete trigonometric transforms, is developed.
متن کاملNumerical Stability of Fast Trigonometric Transforms – A Worst Case Study
This paper presents some new results on numerical stability for various fast trigonometric transforms. In a worst case study, we consider the numerical stability of the classical fast Fourier transform (FFT) with respect to different precomputation methods for the involved twiddle factors and show the strong influence of precomputation errors on the numerical stability of the FFT. The examinati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym13010061